package interview.Algorithms;

public class Testing {
	public static void main(String[] args) {
		Graph testGraph = new Graph(8);
		testGraph.addEdge(new Edge(1,2,7));
		testGraph.addEdge(new Edge(1,7,6));
		testGraph.addEdge(new Edge(1,6,9));
		testGraph.addEdge(new Edge(2,3,5));
		testGraph.addEdge(new Edge(2,4,10));
		testGraph.addEdge(new Edge(2,7,2));
		testGraph.addEdge(new Edge(3,4,4));
		testGraph.addEdge(new Edge(3,5,13));
		testGraph.addEdge(new Edge(4,7,17));
		testGraph.addEdge(new Edge(4,8,3));
		testGraph.addEdge(new Edge(4,5,8));
		testGraph.addEdge(new Edge(5,8,16));
		testGraph.addEdge(new Edge(5,6,20));
		testGraph.addEdge(new Edge(6,7,12));
		testGraph.addEdge(new Edge(6,8,14));
		testGraph.addEdge(new Edge(7,8,1));
		//new MST().primsMethod(testGraph);
		//new Dijkstra().shortestDistance(testGraph, 1);
		
		
		int elements[] = {0,5,3,4};
		int weights[]  = {0,3,2,1};
		int size =5;
		new Knapsack().bestFit(elements, weights, size);
	}
}
